On terms

Unification on Compressed Terms

First-order term unification is an essential concept in areas like functional and logic programming, automated deduction, deductive databases, artificial intelligence, information retrieval, compiler design, etc. We build upon recent developments in grammar-based compression mechanisms for terms and investigate algorithms for first-order unification and matching on compressed terms. We prove th...

Induction on Concurrent Terms

This paper considers MiniML equipped with a standard big-step semantics and a destination-passing semantics both represented in concurrent LF (CLF) and prove the two semantics equivalent. The proof is then examined yielding insights into the issues concerning induction on concurrent terms. We conclude by outlining some of the difficulties that one will need to address when designing a meta-logi...

On equal μ-terms

We consider the rewrite system Rμ with μx.M →μ M[x := μx.M] as its single rewrite rule, where the signature consists of the variable binding operator commonly denoted by μ, first-order symbols, which in this paper are restricted to a binary function symbol F, and possibly some constant symbols. This kernel system denoting recursively defined objects occurs in several contexts, e.g. it is the fr...

Constraint Solving on Terms :

Accessed Terms of Use Detailed Terms + ) Reaction On

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. 197 Au targets were measured at the Thomas Jefferson National Accelerator Facility (Jefferson Lab) to extract nucle...